Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimization

نویسندگان

  • Manuel López-Ibáñez
  • Thomas Stützle
چکیده

This chapter introduces two Perl programs that implement graphical tools for exploring the performance of stochastic local search algorithms for biobjective optimization problems. These tools are based on the concept of the empirical attainment function (EAF), which describes the probabilistic distribution of the outcomes obtained by a stochastic algorithm in the objective space. In particular, we consider the visualization of attainment surfaces and differences between the first-order EAFs of the outcomes of two algorithms. This visualization allows us to identify certain algorithmic behaviors in a graphical way. We explain the use of these visualization tools and illustrate them with examples arising from practice. Experiments in computer science often produce large amounts of data, mainly because experiments can be set up, performed and repeated with relative facility. Given the amount of data, exploratory data analysis techniques are one of the most important tools that computer scientists may use to support their findings. In particular, specialized graphical techniques for representing data are often used to perceive trends and patterns in the data. For instance, there exist techniques for the extraction of relevant variables, the discovery of hidden structures, and the detection of outliers and other anomalies. Such exploratory techniques are mainly used during the design of an algorithm and when comparing the performance of various algorithms. Even before testing more formal hypotheses, the algorithm designer has to find patterns in experimental data that provide further insights into new ways of improving performance. In this chapter, we focus on the graphical interpretation of the quality of the outcomes returned by Stochastic Local Search (SLS) algorithms [Hoos and Stützle, Luı́s Paquete CISUC, Department of Informatics Engineering, University of Coimbra, Portugal e-mail: [email protected] Manuel López-Ibáñez, Thomas Stützle IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium e-mail: [email protected],[email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective Hybrid Stochastic Local Search Algorithms for Biobjective Permutation Flowshop Scheduling

This paper presents the steps followed in the design of hybrid stochastic local search algorithms for biobjective permutation flow shop scheduling problems. In particular, this paper tackles the three pairwise combinations of the objectives (i) makespan, (ii) the sum of the completion times of the jobs, and (iii) the weighted total tardiness of all jobs. The proposed algorithms are combinations...

متن کامل

An Analysis of Algorithmic Components for Multiobjective Ant Colony Optimization: A Case Study on the Biobjective TSP

In many practical problems, several conflicting criteria exist for evaluating solutions. In recent years, strong research efforts have been made to develop efficient algorithmic techniques for tackling such multi-objective optimization problems. Many of these algorithms are extensions of well-known metaheuristics. In particular, over the last few years, several extensions of ant colony optimiza...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study

In this article, we study Pareto local optimum sets for the biobjective Traveling Salesman Problem applying straightforward extensions of local search algorithms for the single objective case. The performance of the local search algorithms is illustrated by experimental results obtained for well known benchmark instances and comparisons to methods from literature. In fact, a 3-opt local search ...

متن کامل

Effective Stochastic Local Search Algorithms For Bi-Objective Permutation Flowshop Scheduling

In this report, we study stochastic local search (SLS) algorithms for biobjective optimization problems. In particular, we study multi-objective algorithms that belong to two different classes of approaches, those that use a scalarized acceptance criterion (SAC) and those that use a componentwise acceptance criterion (CWAC). As a representative example of a SAC algorithm, we study Two-Phase Loc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009